National Repository of Grey Literature 67 records found  1 - 10nextend  jump to record: Search took 0.01 seconds. 
Agent Based Gameplaying System
Trutman, Michal ; Zbořil, František (referee) ; Král, Jiří (advisor)
This thesis deals with general game playing agent systems. On the contrary with common agents, which are designed only for a specified task or a game, general game playing agents have to be able to play basically any arbitrary game described in a formal declarative language. The biggest challenge is that the game rules are not known beforehand, which makes it impossible to use some optimizations or to make a good heuristic function. The thesis consists of a theoretical and a practical part. The first part introduces the field of general game playing agents, defines the Game Description Language and covers construction of heuristic evaluation functions and their integration within the Monte Carlo tree search algorithm. In the practical part, a general method of creating a new heuristic function is presented, which is later integrated into a proper agent, which is compared then with other systems.
Mathematical models for transportation problems
Votavová, Helena ; Novotný, Jan (referee) ; Popela, Pavel (advisor)
The thesis deals with modelling and solution techniques for the selected transportation problems. Firstly, historical remarks and application-related comments are introduced. Then the selected transportation problems are defined and mathematical programming and graph theory concepts are utilised to model them. The travelling salesman problem and suitable algorithms are under focus. The original implementation in GAMS and Python is discussed. Algorithms have been tested for the instance based on the set of 73 towns in the Czech Republic. Finally, the test results are evaluated and compared.
Comparison of Methods for Travelling Salesman Problem
Šušová, Lucia ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
This work is about comparison of methods for solving the traveling salesman problem. There are many algorithms for finding solution of this NP complete problem but it is not easy to choose the right one. Main goal of this thesis is experimental methods comparison between each other. Reader is going to learn what result she can expect if she chooses certain algorithm for finding the path. First part is focused on theoretical basics where is described all needed information for understanding the problem. Second part describes single heuristics and methods for solving these problems. The methods are divided into groups by principle of working. Next part contains experimental comparison of methods. This comparison was done based on own implementation of single heuristics. The following part of this work contains information about this implementation and also describes comparison application. Next possible steps of this project are described in conclusion.  
Advanced path optimalisation methods for autonomous car model
Vladyka, Vojtěch ; Macho, Tomáš (referee) ; Petyovský, Petr (advisor)
This paper is about design of mechanical and control solution of autonomous model car. Primary design points are given by rules of The Freescale Cup for which is model designed.
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
Complex Waste Collection Models
Nevrlý, Vlastimír ; Šenkeřík, Roman (referee) ; Procházka,, Vít (referee) ; Stehlík, Petr (advisor)
The subject of this doctoral thesis is the solution of logistics systems in the context of waste management. The work begins with an extensive research in the field of modelling various situations from the waste transportation chain. There are presented multiple types of practical tasks in the area of operation research applicable to waste management. Their possibilities of extension and modification are analysed for use by investors, technical services or waste collection service providers. An essential part of the work is the identification of critical parameters in the waste collection at the level of municipalities and micro-regions. Based on practical requirements, challenges related to the improvement of decision-making and planning systems are defined. The available techniques proved to be insufficient for practical problems. For the area of changes and designs of collection systems (design and modification of routes, choice of the vehicle fleet, collection plan, etc.) there are no procedures that would include a whole range of operating conditions and parameters. The boundary conditions of the task affecting fundamental requirements are highly variable. The thesis presents a comprehensive approach, which is divided into several phases. The preparation and analysis of input data focused mainly on the creation of transport infrastructure, allocation of waste collection containers and their pairing to the network, which also reduces the size of the task. Furthermore, a procedure for compliance with the rules of the road was designed using a penalty function, and an algorithm for defining imaginary edges was implemented, which will allow distinguishing the frequency of collection on selected network segments. To reduce the size of the task, a segment clustering algorithm was also designed, which will enable the calculation of the collection even for larger areas. Input parameters related to operating time and fullness of collection containers are elaborated in greater detail, as they most influence the results of the task. A great benefit is also the algorithm generating the initialization solution from historical routes. As part of the related publishing activities, environmental criteria were defined to evaluate global and local impacts of waste transportation and treatment. The outputs of the thesis are used primarily for the analysis of collection systems, to support the deployment of waste containers, planning collection routes, time schedules and dimensioning the size of the vehicle fleet. The proposed algorithms were tested in several case studies, which proved the broad applicability of a comprehensive tool in the field of waste logistics. Although the thesis is focused on modelling the collection of municipal waste, the usability of the implemented procedures is possible in other areas of waste management or other sectors.
Travelling Salesman Problem Application in Particular Logistics Enterprise
Ružička, Vladimír ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
This paper deals with optimal distribution issues. One may find listed problems of real life linked to distribution. Moreover, there are explained travelling salesman problem, vehicle routing problem and its variants. This work brings an overview of different ways how to solve vehicle routing problem. In practical part, there is an analysis of distribution of real company. The concept of application is presented in the second part of this paper. This concept could reduce costs of distribution in analyzed company. Testing is aimed mainly on the variant VRPCL (Vehicle Routing Problem with Continuos Loading).
Playing the Board Game Stratego by Computer
Irovský, Dominik ; Šátek, Václav (referee) ; Zbořil, František (advisor)
The topic of this thesis is the board game of Stratego. This game features incomplete information. The goal of this thesis is research of existing game playing algorithms and, design and implementation of new solution. For the new solution modified version of Monte Carlo Tree Search was used. The solution was implemented as a console application with possibility of future expansion. Functionality of the solution was validated and tested using experiments. Effectivity of the final algorithm was satisfying
Model of Generation Y Customer on the Market of Banking and Other Financial Products in the Context of Behavioral Economics
Fojtů, Kateřina ; Dohnalová, Zuzana (referee) ; Rozmahel, Petr (referee) ; Vochozka, Marek (referee) ; Škapa, Stanislav (advisor)
The dissertation focuses on identifying a typical generation Y representative on the financial products market and, on the basis of these characteristics, creates a model of generation Y customer on the financial products market in the context of behavioral economics. Based on the literature research, the terms "generation Y" and "selected knowledge of behavioral economics" were defined. The literature research also led to creating a questionnaire that was used to obtain primary research data. Secondary research has characterized consumers on the financial products market. Secondary research focused on the form of payment; relationship to technologies; cash and cashless payments; relation to cryptocurrencies; relation to savings; digital banking transformation; financial behavior of Czech households. Primary research has focused on obtaining information in the field of behavioral economics, specifically the prejudices of the Czech generation Y; and on what financial market products the Czech generation Y uses and generation’s relationship to risks, provided information and satisfaction with products. Primary research data was used as input data for structural equation modeling. Because of this method, mutual relationships between selected products have been found; customer characteristics and heuristics. The benefit of this work lies in the characteristics of customers in the selected market. It is a sector that is slowly entering the digitalization period, and understanding the young generation, which now accounts for a third of its customers, is crucial for companies. If companies are not able to respond to the changing needs of the younger generations, they can lose their customers and hence revenue.
Evolutionary algorithms for global optimization problem solving
Dragon, Ondřej ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This work is devoded to evolutionary algorithms and solution of global optimization problems, mainly the traveling salesman problem. The traveling salesman problem is analyzed in detail as well as its methods of solution, such as: graph theory, heuristics and evolutionary algorithms. The main optimization method of this work is a Inver - over operator. In conclusion are implemented selected methods and performed testing and evaluation of the individual data sets.

National Repository of Grey Literature : 67 records found   1 - 10nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.